Asymptotics of Markov Kernels and the Tail Chain
نویسندگان
چکیده
An asymptotic model for extreme behavior of certain Markov chains is the ``tail chain''. Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this model in a more general context, formulated in terms of extreme value theory for transition kernels, and extend it by formalizing the distinction between extreme and non-extreme states. We make the link between the update function and transition kernel forms considered in previous work, and we show that the tail chain model leads to a multivariate regular variation property of the finite-dimensional distributions under assumptions on the marginal tails alone. An asymptotic model for extreme behavior of certain Markov chains is the ``tail chain''. Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this model in a more general context, formulated in terms of extreme value theory for transition kernels, and extend it by formalizing the distinction between extreme and non-extreme states. We make the link between the update function and transition kernel forms considered in previous work, and we show that the tail chain model leads to a multivariate regular variation property of the finite-dimensional distributions under assumptions on the marginal tails alone. ASYMPTOTICS OF MARKOV KERNELS AND THE TAIL CHAIN SIDNEY I. RESNICK AND DAVID ZEBER Abstract. An asymptotic model for extreme behavior of certain Markov chains is the “tail chain”. Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this model in a more general context, formulated in terms of extreme value theory for transition kernels, and extend it by formalizing the distinction between extreme and non-extreme states. We make the link between the update function and transition kernel forms considered in previous work, and we show that the tail chain model leads to a multivariate regular variation property of the finite-dimensional distributions under assumptions on the marginal tails alone. An asymptotic model for extreme behavior of certain Markov chains is the “tail chain”. Generally taking the form of a multiplicative random walk, it is useful in deriving extremal characteristics such as point process limits. We place this model in a more general context, formulated in terms of extreme value theory for transition kernels, and extend it by formalizing the distinction between extreme and non-extreme states. We make the link between the update function and transition kernel forms considered in previous work, and we show that the tail chain model leads to a multivariate regular variation property of the finite-dimensional distributions under assumptions on the marginal tails alone.
منابع مشابه
Subexponential Asymptotics of a Network Multiplexer
For a Markov-modulated random walk with negative drift and long-tailed right tail we prove that the ascending ladder height matrix distribution is asymptotically proportional to a long-tailed distribution. This result enable us to generalize a recent result on subexponential asymptotics of a Markov-modulated M/G/1 queue to subexponential asymptotics of a Markov-modulated G/G/1 queue. For a clas...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملLimit Theorems for Some Adaptive Mcmc Algorithms with Subgeometric Kernels: Part Ii
We prove a central limit theorem for a general class of adaptive Markov Chain Monte Carlo algorithms driven by sub-geometrically ergodic Markov kernels. We discuss in detail the special case of stochastic approximation. We use the result to analyze the asymptotic behavior of an adaptive version of the Metropolis Adjusted Langevin algorithm with a heavy tailed target density.
متن کاملAsymptotics for Steady-state Tail Probabilities in Structured Markov Queueing Models
In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...
متن کاملSubexponential asymptotics of the stationary distributions of M/G/1-type Markov chains
This paper studies the subexponential asymptotics of the stationary distribution of an M/G/1-type Markov chain. We provide a sufficient condition for the subexponentiality of the stationary distribution. The sufficient condition requires only the subexponential integrated tail of level increments. On the other hand, the previous studies assume the subexponentiality of level increments themselve...
متن کامل